class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> ans;
        int n = nums.size();
        if(n == 0) return {-1, -1};
        int left = 0, right = n - 1;
        while(left < right)
        {
            int mid = (left + right) >> 1;
            if(nums[mid] >= target) right = mid;
            else left = mid + 1; 
        }
        if(nums[left] != target) return {-1, -1};
        ans.push_back(left);
        left = 0; right = n - 1;
        while(left < right)
        {
            int mid = (left + right + 1) >> 1;
            if(nums[mid] <= target) left = mid;
            else right = mid - 1;
        }
        ans.push_back(left);
        return ans;
    }
};
